Partitioning and modularity of graphs with arbitrary degree distribution
نویسندگان
چکیده
منابع مشابه
Partitioning and modularity of graphs with arbitrary degree distribution.
We solve the graph bipartitioning problem in dense graphs with arbitrary degree distribution using the replica method. We find the cut size to scale universally with . In contrast, earlier results studying the problem in graphs with a Poissonian degree distribution had found a scaling with square root [Fu and Anderson, J. Phys. A 19, 1605 (1986)]. Our results also generalize...
متن کاملPartitioning and coloring graphs with degree constraints
We prove that if G is a vertex-critical graph with χ(G) ≥ ∆(G) + 1 − p ≥ 4 for some p ∈ N and ω(H(G)) ≤ χ(G)+1 p+1 − 2, then G = Kχ(G) or G = O5. Here H(G) is the subgraph of G induced on the vertices of degree at least χ(G). This simplifies the proofs and improves the results in the paper of Kostochka, Rabern and Stiebitz [8].
متن کاملPartitioning Graphs of Regular Degree
Graph-Partitioning problems occur in a wide range of applications. The task is to divide the vertices of a graph in equally sized parts such that as few edges as possible are crossing the boundaries. The calculation of an optimal result is NP-complete. We show a new strategy to derive upper bounds on the bisection width of graphs with regular degree. It gives optimal upper bounds for very small...
متن کاملPartitioning Random Graphs with General Degree Distributions
We consider the problem of recovering a planted partition (e.g., a small bisection or a large cut) from a random graph. During the last 30 years many algorithms for this problem have been developed that work provably well on models resembling the Erdős-Rényi model Gn,m. Since in these random graph models edges are distributed very uniformly, the recent theory of large networks provides convinci...
متن کاملDegree switching and partitioning for enumerating graphs to arbitrary orders of accuracy
We provide a novel method for constructing asymptotics (to arbitrary accuracy) for the number of directed graphs that realize a fixed bidegree sequence d = (a,b) ∈ ZN×2 with maximum degree dmax = O(S 1 2 −τ ) for an arbitrarily small positive number τ , where S is the number edges specified by d. Our approach is based on two key steps, graph partitioning and degree preserving switches. The form...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2007
ISSN: 1539-3755,1550-2376
DOI: 10.1103/physreve.76.015102